Automatic Construction of Compact Motion Graphs

نویسندگان

  • Philippe Beaudoin
  • Michiel van de Panne
  • Pierre Poulin
چکیده

Motion capture data often requires substantial processing before it becomes useful. We propose a technique that automatically distills a compact motion graph from an arbitrary collection of motion capture data. At its heart, the process identifies clusters of similar motions which we call “motion bundles”. Motion bundles and their encompassing motion graph provide a readily understandable structuring of the motion data. They can serve as a shared tool in support of common types of motion processing, including motion segmentation, motion compression, the creation of blend spaces, and the identification of connectivity to support motion resequencing. We use a novel string-based representation of motions to help find motion bundles. Users can specify a preference for longduration bundles or bundles containing many motions. We demonstrate results using data for boxing, walking and various exercise motions, and we show that meaningful partitions are retained in the face of noise.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More Equienergetic Signed Graphs

The energy of signed graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Two signed graphs are said to be equienergetic if they have same energy. In the literature the construction of equienergetic signed graphs are reported. In this paper we obtain the characteristic polynomial and energy of the join of two signed graphs and thereby we give another construction ...

متن کامل

Automatic detection of liver tumor motion by fluoroscopy images

Background: A method to track liver tumor motion signals from fluoroscopic images without any implanted gold fiducial markers was proposed in this study to overcome the adverse effects on precise tumor irradiation caused by respiratory movement. Materials and Methods: The method was based on the following idea: (i) Before treatment, a series of fluoroscopic images corresponding to different bre...

متن کامل

Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs

In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...

متن کامل

Designing Solvable Graphs for Multiple Moving Agents

Solvable Graphs (also known as Reachable Graphs) are types of graphs that any arrangement of a specified number of agents located on the graph’s vertices can be reached from any initial arrangement through agents’ moves along the graph’s edges, while avoiding deadlocks (interceptions). In this paper, the properties of Solvable Graphs are investigated, and a new concept in multi agent moti...

متن کامل

Fractal Dimension of Graphs of Typical Continuous Functions on Manifolds

If M is a compact Riemannian manifold then we show that for typical continuous function defined on M, the upper box dimension of  graph(f) is as big as possible and the lower box dimension of graph(f) is as small as possible.  

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007